#include<iostream>
//#include<string>
#include<cstdio>
//#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int a[1005];

int main()
{
    int n;
    cin>>n;
    for (int i=1;i<=n;i++)
    	cin>>a[i];
    sort(a+1,a+n);
    int tot=0,temp=0,tmp=0;
    for (int i=1;i<=n;i++)
    {
    	if (a[i]==a[i+1]) tot++;
    	else
    	{
    		if (tot>=ceil(n/2))
    		{
    			tmp=a[i];
    			temp=tot;
			}	
    		tot=0;
		}
	}
	if (temp) cout<<tmp<<endl;
	else cout<<"no"<<endl;
    
    return 0;
}